. Tight Bounds on the Complexity of Cascaded Decomposition of Automata. In Proc. 31st Annual Symposium on Foundations of Computer Science, Pages 672-682, 1990.
@InProceedings{maler90AUTHOR={Maler,
Title = {Tight Bounds on the Complexity of Cascaded Decomposition of Automata},
BookTitle = {Proc. 31st Annual Symposium on Foundations of Computer Science},
Pages = {672--682},
Publisher = {vol. I, IEEE Computer Society Press},
Year = {1990}
}
Charger la référence EndNote (.ref)
This page is part the Espresso project web site.
It has been automatically generated using the bib2html program.